A Linear Algorithm for Polygonal Approximations of Thick Curves
نویسنده
چکیده
The concept of fuzzy segment was introduced in [2]. In this paper we suggest a notion of strict fuzzy segment and provide a linear algorithm for recognizing it thanks to a simple property of convex hull. A linear method to decompose a thick curve into strict fuzzy segments is also given. The quality of decomposition can be easily controlled by setting two threshold values: the maximum order and the minimum density of the fuzzy segments. The algorithm is fast, practical and multi-purpose.
منابع مشابه
Multiresolution Approximation of Polygonal Curves in Linear Complexity
We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality between successive levels of resolution using dynamic programming. We show theoretically and experimentally that this algorithm has a linear complexity in time and space. We experimentally compare the outcomes of our alg...
متن کاملInvariant Signatures from Polygonal Approximations of Smooth Curves
In this paper we propose to use invariant signatures of polygonal approximations of smooth curves for projective object recognition. Similar signatures have been proposed previously as simple and robust signatures. However, they were known to be sensitive to the curve sampling scheme and density, and worked well mainly for in-trinsically polygonal shapes. This paper proposes a re-sampling metho...
متن کاملTranslational Covering of Closed Planar Cubic B-Spline Curves
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering decision problems for shapes bounded by spline curves. As a first step in addressing these problems, this paper treats translational spline covering for planar, uniform, cubic B-splines. Inner and outer polygonal approxim...
متن کاملInteractive Re-Polygonization of Blobby Implicit Curves
An interactive modeling system for implicit curves is presented. Unlike other interactive algorithms, ours displays connected polygonal approximations instead of several unconnected points. We also guarantee that the topology of our polygonal approximation matches the topology of the true curve. The system currently handles only 2-D blobby curves, but will be extended to include general 3-D imp...
متن کاملAverage curve of n smooth planar curves
We define the Average Curve (AC) of a compatible set of two or more smooth and planar, Jordan curves. It is independent of their order and representation. We compare two variants: the valley AC (vAC), defined in terms of the valley of the field that sums the squared distances to the input curves, and the zero AC (zAC), defined as the zero set of the field that sums the signed distances to the i...
متن کامل